Kleene's Two Kinds of Recursion
نویسنده
چکیده
This is an elementary expository article regarding the application of Kleene’s Recursion Theorems in making definitions by recursion. Whereas the Second Recursion Theorem (SRT) is applicable in a first-order setting, the First Recursion Theorem (FRT) requires a higherorder setting. In some cases both theorems are applicable, but one is stronger than the other: the FRT always produces least fixed points, but this is not always the case with the SRT. Nevertheless, an old result by Rogers allows us to bridge this gap by subtly redefining the implementation of a higher-order functional in order to bring it to a ‘standard form.’ §
منابع مشابه
Kleene's Amazing Second Recursion Theorem
Part 1. Self-reference . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1. Self reproducing Turing machines . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2. Myhill’s characterization of r.e.-complete sets . . . . . . . . . . . . . . . . . . . . . . . . . 5 3. The Myhill-Shepherdson Theorem . . . . . . . . . ....
متن کاملEffectivity Questions for Kleene's Recursion Theorem
The present paper explores the interaction between two recursion-theoretic notions: program self-reference and learning partial recursive functions in the limit. Kleene’s Recursion Theorem formalises the notion of program self-reference: It says that given a partial-recursive function ψp there is an index e such that the e-th function ψe is equal to the e-th slice of ψp. The paper studies const...
متن کاملRei£asable without Limitations on Dissemination
The concept of least fixed-point of a continuous function can be considered as the unifying thread of this dissertation. The connections between fixed-points and recursive programs are detailed in Chapter 2, providing some insights on practical implementations of recursion. There are two usual characterizations of the least fixed-point of a continuous function. To the first characterization, du...
متن کاملLambda-calculus Models of Programming Languages
Two aspect of programming languages, recursive definitions and type declarations are analyzed in detail. Church's %-calculus is used as a model of a programming language for purposes of the analysis. The main result on recursion is an analogue to Kleene's first recursion theorem: If A = FA for any %-expressions A and F, then A is an extension of YF in the sense that if E[YF], any expression con...
متن کاملInnnitary Self Reference in Learning Theory 1
Kleene's Second Recursion Theorem provides a means for transforming any program p into a program e(p) which rst creates a quiescent self copy and then runs p on that self copy together with any externally given input. e(p), in eeect, has complete (low level) self knowledge, and p represents how e(p) uses its self knowledge (and its knowledge of the external world). Innnite regress is not requir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1602.06220 شماره
صفحات -
تاریخ انتشار 2016